Recent Experiences in Parameter-Free Data Mining
Identifieur interne : 000D17 ( Main/Exploration ); précédent : 000D16; suivant : 000D18Recent Experiences in Parameter-Free Data Mining
Auteurs : Kimihito Ito [Japon] ; Thomas Zeugmann [Japon] ; Yu Zhu [Japon]Source :
- Lecture Notes in Electrical Engineering [ 1876-1100 ]
Abstract
Abstract: Recent results supporting the usefulness of the normalized compression distance for the task to classify genome sequences of virus data are reported. Specifically, the problem to cluster the hemagglutinin (HA) sequences of in uenza virus data for the HA gene in dependence on the host and subtype of the virus, and the classification of dengue virus genome data with respect to their four serotypes are studied. A comparison is made with respect to hierarchical and spectral clustering via the kLine algorithm by Fischer and Poland (2004), respectively, and with respect to the standard compressors bzlip, ppmd, and zlib. Our results are very promising and show that one can obtain an (almost) perfect clustering for all the problems studied.
Url:
DOI: 10.1007/978-90-481-9794-1_68
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000353
- to stream Istex, to step Curation: 000353
- to stream Istex, to step Checkpoint: 000138
- to stream Main, to step Merge: 000D22
- to stream Main, to step Curation: 000D17
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Recent Experiences in Parameter-Free Data Mining</title>
<author><name sortKey="Ito, Kimihito" sort="Ito, Kimihito" uniqKey="Ito K" first="Kimihito" last="Ito">Kimihito Ito</name>
</author>
<author><name sortKey="Zeugmann, Thomas" sort="Zeugmann, Thomas" uniqKey="Zeugmann T" first="Thomas" last="Zeugmann">Thomas Zeugmann</name>
</author>
<author><name sortKey="Zhu, Yu" sort="Zhu, Yu" uniqKey="Zhu Y" first="Yu" last="Zhu">Yu Zhu</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:161714CA17455048B08AD86A4A9C9042FD6FC19C</idno>
<date when="2011" year="2011">2011</date>
<idno type="doi">10.1007/978-90-481-9794-1_68</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-XM9BN5P4-M/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000353</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000353</idno>
<idno type="wicri:Area/Istex/Curation">000353</idno>
<idno type="wicri:Area/Istex/Checkpoint">000138</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000138</idno>
<idno type="wicri:doubleKey">1876-1100:2011:Ito K:recent:experiences:in</idno>
<idno type="wicri:Area/Main/Merge">000D22</idno>
<idno type="wicri:Area/Main/Curation">000D17</idno>
<idno type="wicri:Area/Main/Exploration">000D17</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Recent Experiences in Parameter-Free Data Mining</title>
<author><name sortKey="Ito, Kimihito" sort="Ito, Kimihito" uniqKey="Ito K" first="Kimihito" last="Ito">Kimihito Ito</name>
<affiliation wicri:level="1"><country xml:lang="fr">Japon</country>
<wicri:regionArea>Research Center for Zoonosis Control, Hokkaido University, N-20, W-10 Kita-ku, 001-0020, Sapporo</wicri:regionArea>
<wicri:noRegion>Sapporo</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Japon</country>
</affiliation>
</author>
<author><name sortKey="Zeugmann, Thomas" sort="Zeugmann, Thomas" uniqKey="Zeugmann T" first="Thomas" last="Zeugmann">Thomas Zeugmann</name>
<affiliation wicri:level="1"><country xml:lang="fr">Japon</country>
<wicri:regionArea>Division of Computer Science, Hokkaido University, N-14, W-9, 060-0814, Sapporo</wicri:regionArea>
<wicri:noRegion>Sapporo</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Japon</country>
</affiliation>
</author>
<author><name sortKey="Zhu, Yu" sort="Zhu, Yu" uniqKey="Zhu Y" first="Yu" last="Zhu">Yu Zhu</name>
<affiliation wicri:level="1"><country xml:lang="fr">Japon</country>
<wicri:regionArea>Division of Computer Science, Hokkaido University, N-14, W-9, 060-0814, Sapporo</wicri:regionArea>
<wicri:noRegion>Sapporo</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Japon</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Electrical Engineering</title>
<title level="s" type="abbrev">Lect.Notes Electrical Eng. </title>
<idno type="ISSN">1876-1100</idno>
<idno type="eISSN">1876-1119</idno>
<idno type="ISSN">1876-1100</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">1876-1100</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: Recent results supporting the usefulness of the normalized compression distance for the task to classify genome sequences of virus data are reported. Specifically, the problem to cluster the hemagglutinin (HA) sequences of in uenza virus data for the HA gene in dependence on the host and subtype of the virus, and the classification of dengue virus genome data with respect to their four serotypes are studied. A comparison is made with respect to hierarchical and spectral clustering via the kLine algorithm by Fischer and Poland (2004), respectively, and with respect to the standard compressors bzlip, ppmd, and zlib. Our results are very promising and show that one can obtain an (almost) perfect clustering for all the problems studied.</div>
</front>
</TEI>
<affiliations><list><country><li>Japon</li>
</country>
</list>
<tree><country name="Japon"><noRegion><name sortKey="Ito, Kimihito" sort="Ito, Kimihito" uniqKey="Ito K" first="Kimihito" last="Ito">Kimihito Ito</name>
</noRegion>
<name sortKey="Ito, Kimihito" sort="Ito, Kimihito" uniqKey="Ito K" first="Kimihito" last="Ito">Kimihito Ito</name>
<name sortKey="Zeugmann, Thomas" sort="Zeugmann, Thomas" uniqKey="Zeugmann T" first="Thomas" last="Zeugmann">Thomas Zeugmann</name>
<name sortKey="Zeugmann, Thomas" sort="Zeugmann, Thomas" uniqKey="Zeugmann T" first="Thomas" last="Zeugmann">Thomas Zeugmann</name>
<name sortKey="Zhu, Yu" sort="Zhu, Yu" uniqKey="Zhu Y" first="Yu" last="Zhu">Yu Zhu</name>
<name sortKey="Zhu, Yu" sort="Zhu, Yu" uniqKey="Zhu Y" first="Yu" last="Zhu">Yu Zhu</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Sante/explor/H2N2V1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000D17 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000D17 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Sante |area= H2N2V1 |flux= Main |étape= Exploration |type= RBID |clé= ISTEX:161714CA17455048B08AD86A4A9C9042FD6FC19C |texte= Recent Experiences in Parameter-Free Data Mining }}
This area was generated with Dilib version V0.6.33. |